Automated amortised analysis
نویسنده
چکیده
Interpretation. The basic idea of abstract interpretation is to simplify and omit all calculations that do not directly influence the execution costs. For example, instead of computing a numeric value, it is only computed whether it is positive or negative, thereby speeding up the execution of the program to be examined. While having the attraction of being very general, one major disadvantage
منابع مشابه
Multivariate Amortised Resource Analysis for Term Rewrite Systems
We study amortised resource analysis in the context of term rewrite systems. We introduce a novel amortised analysis based on the potential method. The method is represented in an inference system akin to a type system and gives rise to polynomial bounds on the innermost runtime complexity of the analysed rewrite system. The crucial feature of the inference system is the admittance of multivari...
متن کاملEfficient Type-Checking for Amortised Heap-Space Analysis
The prediction of resource consumption in programs has gained interest in the last years. It is important for a number of areas, notably embedded systems and safety critical systems. Different approaches to achieve bounded resource consumption have been analysed. One of them, based on an amortised complexity analysis, has been studied by Hofmann and Jost in 2006 for a Java-like language. In thi...
متن کاملAmortised resource analysis for object-oriented programs
As software systems rise in size and complexity, the need for verifying some of their properties increases. One important property to be verified is the resource usage, i.e. how many resources the program will need for its execution, where resources include execution time, memory, power, etc. Resource usage analysis is important in many areas, in particular embedded systems and cloud computing....
متن کاملAmortised Resource Analysis and Typed Polynomial Interpretations (extended version)
We introduce a novel resource analysis for typed term rewrite systems based on a potential-based type system. This type system gives rise to polynomial bounds on the innermost runtime complexity. We relate the thus obtained amortised resource analysis to polynomial interpretations and obtain the perhaps surprising result that whenever a rewrite system R can be well-typed, then there exists a po...
متن کاملAmortised Resource Analysis and Typed Polynomial Interpretations
We introduce a novel resource analysis for typed term rewrite systems based on a potential-based type system. This type system gives rise to polynomial bounds on the innermost runtime complexity. We relate the thus obtained amortised resource analysis to polynomial interpretations and obtain the perhaps surprising result that whenever a rewrite system R can be well-typed, then there exists a po...
متن کامل